Testing by Narrowing
نویسنده
چکیده
Testing and debugging a program P may require computing an input I such that the execution of P on input I goes through some given path T of P . We describe how to compute such an input for programs coded in a simple imperative language with generic expressions including user-defined abstract data types. For example, consider the following program which computes iteratively a preorder traversal of a tree. Stack and tree are user-defined types.
منابع مشابه
Visual field loss in patients with glaucoma who have asymmetric peripapillary focal arteriolar narrowing.
OBJECTIVE To evaluate the relationship between peripapillary focal arteriolar narrowing and visual field defects. METHODS From our institutional practice, we identified 31 patients with glaucoma who had peripapillary focal arteriolar narrowing in only one eye and compared visual field data between the two eyes. Mean deviation (MD) and corrected pattern standard deviation (CPSD) were recorded ...
متن کاملLearning-Based Testing for Reactive Systems Using Term Rewriting Technology
We show how the paradigm of learning-based testing (LBT) can be applied to automate speci cation-based black-box testing of reactive systems using term rewriting technology. A general model for a reactive system can be given by an extended Mealy automata (EMA) over an abstract data type (ADT). A nite state EMA over an ADT can be e ciently learned in polynomial time using the CGE regular inferen...
متن کاملOn narrowing the gap between verification and systematic testing
Our work on narrowing the gap between verification and systematic testing has two directions: (1) complementing verification with systematic testing, and (2) pushing systematic testing toward reaching verification. In the first direction, we explore how to effectively combine static analysis with systematic testing, so as to guide test generation toward properties that have not been previously ...
متن کاملTermination of rewriting under strategies: a generic approach
ion constraints have to be combined with the narrowing constrained substitutions to characterize the ground terms schematized by the proof trees. A narrowing step effectively corresponds to a rewriting step of ground instances of u if the narrowing constrained substitution σ is compatible with the abstraction constraint formula A associated to u (i.e. A∧ σ is satisfiable). Else, the narrowing s...
متن کاملA Layout Sensitivity Model for Estimating Electromigration-vulnerable Narrow Interconnects
During the back-end manufacturing process of IC, intervention of spot defects induces extra and missing material of interconnects causing circuit failures. In this paper, a new type of spot defects called interconnect “narrowing defect” is defined. Interconnect narrowing occurs when spot defects induce missing material of interconnects without resulting in a complete cut. The narrow sites of de...
متن کاملInspecting Maude variants with GLINTS
This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity (ACU). This novel equational unification relies on built-in ...
متن کامل